Random walk tests for pseudo-random number generators

نویسندگان

  • Smile Markovski
  • Danilo Gligoroski
  • Verica Bakeva
چکیده

It is well known that there are no perfectly good generators of random number sequences, implying the need of testing the randomness of the sequences produced by such generators. There are many tests for measuring the uniformity of random sequences, and here we propose a few new ones, designed by random walks. The experiments we have made show that our tests discover some discrepancies of random sequences passing many other tests.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pseudo Random Coins Show More Heads Than Tails

Tossing a coin is the most elementary Monte-Carlo experiment. In a computer the coin is replaced by a pseudo random number generator. It can be shown analytically and by exact enumerations that popular random number generators are not capable of imitating a fair coin: pseudo random coins show more ‘‘heads’’ than ‘‘tails.’’ This bias explains the empirically observed failure of some random numbe...

متن کامل

Using GLFSRs for Pseudo-Random Memory BIST

In this work, we present the application of Generalized Linear Feedback Shift Registers (GLFSRs) for generation of patterns for pseudo-random memory Built-In SelfTest (BIST). Recently, it was shown that using GLFSRs as pattern generators for pseudo-random logic tests can increase the fault coverage noticeably in comparison to standard pseudo-random test pattern generators. Since memory faults d...

متن کامل

Random Numbers in Scientific Computing: An Introduction

Random numbers play a crucial role in science and industry. Many numerical methods require the use of random numbers, in particular the Monte Carlo method. Therefore it is of paramount importance to have efficient random number generators. The differences, advantages and disadvantages of true and pseudo random number generators are discussed with an emphasis on the intrinsic details of modern a...

متن کامل

On Random Number Generation

Introduction Random numbers play a large and significant role in several fields and applications from cryptography to gaming to gambling. As a result, random number generators (RNGs) occupy a similarly important role. By their very nature, however, random numbers are difficult to fabricate, especially in the large quantities that they are often needed. In this paper I will discuss various topic...

متن کامل

Random Number Generation and Simulation on Vector and Parallel Computers (extended Abstract) Rpb185 Typeset Using L a T E X2e 2

Pseudo-random numbers are often required for simulations performed on parallel computers. The requirements for parallel random number generators are more stringent than those for sequential random number generators. As well as passing the usual sequential tests on each processor, a parallel random number generator must give diierent, independent sequences on each processor. We consider the requ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002